The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines1
نویسنده
چکیده
In this paper we present lower and upper bounds for the deterministic simulation of a Parallel Random Access Machine (PRAM) with n processors and m variables on a Distributed Memory Machine (DMM) with p n processors. The bounds are expressed as a function of the redundancy r of the scheme (i.e., the number of copies used to represent each PRAM variable in the DMM), and become tight for any m polynomial in n and r = (1).
منابع مشابه
Balanced PRAM Simulations via Moving Threads and Hashing
We present a novel approach to parallel computing, where (virtual) PRAM processors are represented as lightweight threads, and each physical processor is capable of managing several threads. Instead of moving read and write requests, and replies between processor&memory pairs (and caches), we move the lightweight threads. Consequently , the processor load balancing problem reduces to the proble...
متن کاملBalanced PRAM Simulations via Moving Threads and Hashing
We present a novel approach to parallel computing, where (virtual) PRAM processors are represented as light-weight threads, and each physical processor is capable of managing several threads. Instead of moving read and write requests, and replies between processor&memory pairs (and caches), we move the light-weight threads. Consequently, the processor load balancing problem reduces to the probl...
متن کاملLower Bounds on Average Time for Random Destination Mesh Routing and Their Utility as Performance Predictors for PRAM Simulation
This paper presents lower bounds on the expected time for random destination routing on a mesh, valid for any routing scheme, queueing discipline and queue size. We show that the lower bounds are applicable to probabil-istic simulation of the P processor EREW PRAM with shared memory M on a P processor mesh with distributed memory M = M, M = P ; > 1, and consider two cases: where the number of p...
متن کاملSimulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures
We consider randomized simulations of shared memory on a distributed memory machine (DMM) where the n processors and the n memory modules of the DMM are connected via a reconfigurable architecture. We first present a randomized simulation of a CRCW PRAM on a reconfigurable DMM having a complete reconfigurable interconnection. It guarantees delay O(log *n), with high probability. Next we study a...
متن کاملShared Memory Simulations with Triple-Logarithmic Delay
We consider the problem of simulating a PRAM on a distributed memory machine (DMM). Our main result is a randomized algorithm that simulates each step of an n-processor CRCW PRAM on an n-processor DMM with O(log log log n log n) delay, with high probability. This is an exponential improvement on all previously known simulations. It can be extended to a simulation of an (n log log log n log n)-p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997